Gemmating P systems: collapsing hierarchies
نویسندگان
چکیده
منابع مشابه
Collapsing Exact Arithmetic Hierarchies
We provide a uniform framework for proving the collapse of the hierarchy NC(C) for an exact arithmetic class C of polynomial degree. These hierarchies collapse all the way down to the third level of the AC-hierarchy, AC3(C). Our main collapsing exhibits are the classes C ∈ {C=NC,C=L,C=SAC,C=P}. NC(C=L) and NC(C=P) are already known to collapse [1,18,19]. We reiterate that our contribution is a ...
متن کاملSubshifts, MSO Logic, and Collapsing Hierarchies
We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In particular, this solves an open problem of [Jeandel & Theyssier 2013]. The results are in stark contrast with picture languages, where such hierarchies are usua...
متن کاملInfinite Hierarchies of Conformon-P Systems
Two models of conformon-P systems, one restricted in the number of input conformons and the other restricted in the number of input membranes, are proved to induce infinite hierarchies. The described systems do not work under the requirement of maximal parallelism and perform deterministic simulations of restricted counter machines.
متن کاملAdaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing
Ray tracing is a computationally intensive process, several tree data structures and heuristics have been developed to optimize it. This paper presents a new heuristic in the area, based on collapsing some nodes in order to achieve a smaller expected number of node-tests. Two ways of using this heuristic in Bounding Volume Hierarchies are presented as well as the cost-model used to drive the he...
متن کاملRewriting P Systems with Conditional Communication: Improved Hierarchies
We consider here a variant of rewriting P systems [1], where communication is controlled by the contents of the strings, not by the evolution rules used for obtaining these strings. Some new characterizations of recursively enumerable languages are obtained by means of P systems with a small number of membranes, which improves some of the known results from [1] and [4].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00657-6